On the exact $$l_{1}$$ penalty function method for convex nonsmooth optimization problems with fuzzy objective function
نویسندگان
چکیده
Abstract In this paper, the convex nonsmooth optimization problem with fuzzy objective function and both inequality equality constraints is considered. The Karush–Kuhn–Tucker necessary optimality conditions are proved for such a extremum problem. Further, exact $$l_{1}$$ l 1 penalty method used solving considered Therefore, its associated penalized constructed in approach. Then, exactness property of analyzed if it
منابع مشابه
The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
The exactness of the penalization for the exact l1 penalty function method used for solving nonsmooth constrained optimization problems with both inequality and equality constraints are presented. Thus, the equivalence between the sets of optimal solutions in the nonsmooth constrained optimization problem and its associated penalized optimization problem with the exact l1 penalty function is es...
متن کاملAn Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
Global convergence in constrained optimization algorithms has traditionally been enforced by the use of parametrized penalty functions. Recently, the filter strategy has been introduced as an alternative. At least part of the motivation for filter methods consists in avoiding the need for estimating a suitable penalty parameter, which is often a delicate task. In this paper, we demonstrate that...
متن کاملAn Evolutionary Algorithm for Zero-one Nonlinear Optimization Problems Based on an Objective Penalty Function Method
In many evolutionary algorithms, as fitness functions, penalty functions play an important role. In order to solve zero-one nonlinear optimization problems, a new objective penalty function is defined in this paper and some of its properties for solving integer nonlinear optimization problems are given. Based on the objective penalty function, an algorithm with global convergence for integer no...
متن کاملA New Exact Penalty Function Method for Continuous Inequality Constrained Optimization Problems∗
In this paper, a computational approach based on a new exact penalty function method is devised for solving a class of continuous inequality constrained optimization problems. The continuous inequality constraints are first approximated by smooth function in integral form. Then, we construct a new exact penalty function, where the summation of all these approximate smooth functions in integral ...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2022
ISSN: ['1433-7479', '1432-7643']
DOI: https://doi.org/10.1007/s00500-022-07459-0